Cheetah: A High-Speed Programmable Load-Balancer Framework With Guaranteed Per-Connection-Consistency

نویسندگان

چکیده

Large service providers use load balancers to dispatch millions of incoming connections per second towards thousands servers. There are two basic yet critical requirements for a balancer: uniform distribution the across servers, which requires support advanced balancing mechanisms, and per-connection-consistency (PCC), i.e, ability map packets belonging same connection server even in presence changes number active servers balancers. Yet, simultaneously meeting these has been an elusive goal. Today’s minimize PCC violations at price non-uniform distribution. This paper presents Cheetah, balancer that supports mechanisms and while being scalable, memory efficient, fast processing packets, offers comparable resilience clogging attacks as with today’s The Cheetah LB design guarantees any realizable selection mechanism can be deployed both stateless stateful manners, depending on operational needs. We implemented software Tofino-based hardware switch. Our evaluation shows version PCC, negligible packet overheads, reduce flow completion time by factor $2-3 \times $ .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Shape Optimizing Load Balancer

Load balancing is an important issue in parallel numerical simulations. However, state-of-the-art libraries addressing this problem show several deficiencies: they are hard to parallelize, focus on small edgecuts rather than few boundary vertices, and often produce disconnected partitions. We present a distributed implementation of a load balancing heuristic for parallel adaptive FEM simulation...

متن کامل

A Novel Load Balancer for Multiprocessor Routers

We develop a novel load-balancing packet scheduler for parallel forwarding systems. By investigating flow level characteristics of Internet traffic, we are able to trace the root for load imbalance in hash-based loadsplitting schemes. Our scheduler capitalizes on the non-uniform flow reference pattern and especially the presence of a few high-rate flows in typical Internet traffic mix. We show ...

متن کامل

Improving Parallel System Performance with a NUMA-aware Load Balancer

Multi-core nodes with Non-Uniform Memory Access (NUMA) are now a common architecture for high performance computing. On such NUMA nodes, the shared memory is physically distributed into memory banks connected by a network. Owing to this, memory access costs may vary depending on the distance between the processing unit and the memory bank. Therefore, a key element in improving the performance o...

متن کامل

(sigma, rho) - Characterization Based Connection Control for Guaranteed Services in High Speed Networks

In this paper we present a method to establish real-time connections with guaranteed quality-of-services, based on per-session (;)-characterization. Under two distinctive service disciplines, rate proportional processor sharing and xed rate processor sharing, we derive tighter probabilis-tic bounds on per-session end-to-end average cell loss rate, which is caused by either buuer over-ow in the ...

متن کامل

p)-Characterization Based Connection Control for Guaranteed Services in High Speed Networks

In this paper ' we present a method to establish real-time connections with guaranteed quality-of-services, based on persession (a, p)-characterization. Under two distinctive service disciplines, rate proportional processor sharing and fixed rate processor sharing, we derive tighter probabilistic bounds on per-session end-to-end average cell loss rate, which i s caused by either buffer overflow...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE ACM Transactions on Networking

سال: 2022

ISSN: ['1063-6692', '1558-2566']

DOI: https://doi.org/10.1109/tnet.2021.3113370